Parallel bottom-up processing of datalog queries
نویسندگان
چکیده
منابع مشابه
Bottom-Up Bisimilar Datalog Goals
We introduce the concept of bisimulation between Datalog goals using bottom-up evaluation technique: two Datalog goals are bisimilar with respect to a given Datalog program equipped with a bottom-up evaluation technique when their resolution trees are bisimilar. We define the notion of a resolution tree and we address the problem of deciding whether two given goals are bisimilar with respect to...
متن کاملParallel Bottom-up Evaluation of Datalog Progrm~ by Load Sharing Parallel Boitom·up Evaluanon of Datalog Programs by Load Sharing
We propose a method of parallelizing bottom-up-evaluation of logic programs. The method is distinguished by the fact that it is pUTe i.e., does not require interprocessor communication, or synchronization overhead. The method cannot be used to parallelize every logic progtam, but we syntactically characterize several classes of logic programs to which the method can be applied (e.g., the class ...
متن کاملBottom-Up Evaluation of Datalog: Preliminary Report
Bottom-up evaluation of Datalog has been studied for a long time, and is standard material in textbooks. However, if one actually wants to develop a deductive database system, it turns out that there are many implementation options. For instance, the sequence in which rule instances are applied is not given. In this paper, we study a method that immediately uses a derived tuple to derive more t...
متن کاملTransforming XPath Queries for Bottom-Up Query Processing
The widespreading of XML as a content-description language on the Web requires advanced processing and management techniques for huge XML databases. XPath is a standard language for extracting the specified elements from XML documents, and its efficient support is one of the key issues in the current XML database technology. In this paper, we propose an XPath query transformation method for the...
متن کاملBottom-up Evaluation of Finitely Recursive Queries
The support for function symbols in logic programming under Answer Set Programming semantics (ASP) allows to overcome some modeling limitations of traditional ASP systems, such as the inability of handling infinite domains. On the other hand, admitting function symbols in ASP makes inference undecidable in the general case. Thus, the research is lately focusing on finding proper subclasses of A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1992
ISSN: 0743-1066
DOI: 10.1016/0743-1066(92)90048-8